The Cell Probe Complexity of Succinct Data Structures
نویسندگان
چکیده
From 22.02. to 27.02.2004, the Dagstuhl Seminar 04091 Data Structures was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar are put together in this paper. The rst section describes the seminar topics and goals in general.
منابع مشابه
Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication
The conjectured hardness of Boolean matrix-vector multiplication has been used with great success to prove conditional lower bounds for numerous important data structure problems, see Henzinger et al. [STOC’15]. In recent work, Larsen and Williams [SODA’17] attacked the problem from the upper bound side and gave a surprising cell probe data structure (that is, we only charge for memory accesses...
متن کاملCell probe lower bounds for succinct data structures
In this paper, we consider several static data structure problems in the deterministic cell probe model. We develop a new technique for proving lower bounds for succinct data structures, where the redundancy in the storage can be small compared to the informationtheoretic minimum. In fact, we succeed in matching (up to constant factors) the lower order terms of the existing data structures with...
متن کاملA Lower Bound for Succinct Rank Queries
The rank problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries of the form Rank(k) = ∑k i=1 A[i]. The problem has been intensely studied, and features as a subroutine in a majority of succinct data structures. We show that in the cell probe model with w-bit cells, if rank takes t time, th...
متن کاملA Survey of Communication Complexity for Proving Lower Bound of Data Structures in Cell-Probe Model
Proving lower bounds for computational problem is always a challenging work. In this survey, we will present some techniques for proving lower bound of data structures in cellprobe model. There is a natural relationship between cell-probe model and communication complexity, so many proofs of lower bound in cell-probe model are related to communication complexity. In communication complexity, th...
متن کاملCell-Probe Proofs and Nondeterministic Cell-Probe Complexity
We study the nondeterministic cell-probe complexity of static data structures. We introduce cell-probe proofs (CPP), a proof system for the cell-probe model, which describes verifications instead of computations in the cell-probe model. We present a combinatorial characterization of CPP. With this novel tool, we prove the following lower bounds for the nondeterministic cell-probe complexity of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 379 شماره
صفحات -
تاریخ انتشار 2003